Counting Upper Interactions in Dyck Paths
نویسندگان
چکیده
A Dyck word w is a word over the alphabet {x, x} that contains as many letters x as letters x and such that any prefix contains at least as many letters x as letters x. The size of w is the number of letters x in w. A Dyck path is a walk in the plane, that starts from the origin, is made up of rises, i.e. steps (1, 1), and falls, i.e. steps (1,−1), remains above the horizontal axis and finishes on it. Figure 1 gives an example of a Dyck path of size 12. The Dyck path related to a Dyck word w is the walk obtained by representing a letter x by a rise, and a letter x by a fall. In this paper we identify the two notions. An upper interaction, respectively a lower interaction, in a Dyck word w is an occurrence of a factor xx, respectively xx, for any k ≥ 1. The example of Figure 1 contains 7 upper interactions and 9 lower interactions.
منابع مشابه
Bi-banded paths, a bijection and the Narayana numbers
We find a bijection between bi-banded paths and peak-counting paths, applying to two classes of lattice paths including Dyck paths. Thus we find a new interpretation of Narayana numbers as coefficients of weight polynomials enumerating bi-banded Dyck paths, which class of paths has arisen naturally in previous literature in a solution of the stationary state of the ‘TASEP’ stochastic process.
متن کاملThe Dyck pattern poset
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...
متن کاملCounting Generalized Dyck Paths
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from (0, 0) to (n, n) which is below the diagonal line y = x. One way to generalize the definition of Dyck path is to change the end point of Dyck path, i.e. we define (generalized) Dyck path to be a lattice path from (0, 0) to (m, n) ∈ N2 which is below the diagonal line y...
متن کاملPattern - avoiding Dyck paths †
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...
متن کاملCounting peaks and valleys in k-colored Motzkin paths
This paper deals with the enumeration of k-colored Motzkin paths with a fixed number of (left and right) peaks and valleys. Further enumeration results are obtained when peaks and valleys are counted at low and high level. Many well-known results for Dyck paths are obtained as special cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007